Reconstruction of the path graph
نویسندگان
چکیده
منابع مشابه
Reconstruction of the Path Graph
Let P be a set of n ≥ 5 points in convex position in the plane. The path graph G(P ) of P is an abstract graph whose vertices are non-crossing spanning paths of P , such that two paths are adjacent if one can be obtained from the other by deleting an edge and adding another edge. We prove that the automorphism group of G(P ) is isomorphic to Dn, the dihedral group of order 2n. The heart of the ...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملGraph Reconstruction
In 1941 Kelly and Ulam proposed the Graph Reconstruction Conjecture, and it has remained an open problem to this day[3]. The Graph Reconstruction Conjecture states simply that any simple finite undirected graph on 3 or more vertices can be uniquely identified (up to isomorphism) by the multiset of its unlabeled 1-vertex-deleted subgraphs. There are no known counter-examples to the Conjecture, a...
متن کاملThe Path Space of a Directed Graph
We construct a locally compact Hausdorff topology on the path space of a directed graph E and identify its boundary-path space ∂E as the spectrum of a commutative C∗-subalgebra DE of C∗(E). We then show that ∂E is homeomorphic to a subset of the infinite-path space of any desingularisation F of E. Drinen and Tomforde showed that we can realise C∗(E) as a full corner of C∗(F ), and we deduce tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2018
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2018.02.002